Valid Identity Problem for Shuffle Regular Expressions
نویسندگان
چکیده
We show that the following problem is decidable: given are expressions E1 and E2 constructed from variables by the regular operations and shuffle. Is the identity E1 = E2 true for all instantiations of its variables by formal languages?
منابع مشابه
Distributed Time-Asynchronous Automata
We show that the class of distributed time-asynchronous automata is more expressive than timed automata, has a decidable emptiness problem, is closed under union, concatenation, star, shuffle and renaming, but not under intersection. The closure results are obtained by showing that distributed time-asynchronous automata are equivalent with a subclass of shuffle regular expressions and its relat...
متن کاملA novel algorithm for the conversion of shuffle regular expressions into non-deterministic finite automata
Regular expressions with shuffle operators are widely used in diverse fields of computer science. The work presented here investigates the shuffling of regular expressions and their conversion into non-deterministic finite automata. The aim of the paper is to design a novel algorithm for constructing -free non-deterministic finite automata from the shuffling of regular expressions. Non-determ...
متن کاملPartial Derivative Automaton for Regular Expressions with Shuffle
We generalize the partial derivative automaton to regular expressions with shuffle and study its size in the worst and in the average case. The number of states of the partial derivative automata is in the worst case at most 2m, where m is the number of letters in the expression, while asymptotically and on average it is no more than ( 4 3 )m.
متن کاملDecidability of Split Equivalence
We show that the following problem is decidable: given expressions E1 and E2 constructed from variables by the regular operations and shuffle, is the identity E1 = E2 true for all instantiations of its variables by strings? Our proof uses the notations developed in the causal approach to concurrency. As a byproduct we obtain decidability of similar equivalence for other formalisms. In particula...
متن کاملThere is no complete axiom system for shuffle expressions
In this paper we show that neither the set of all valid équations between shuffie expressions nor the set of schémas of valid équations is recursively enumerable. Thus, neither of the sets can be recursively generated by any axiom System. AMS Subject Classification. 68Q45.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Automata, Languages and Combinatorics
دوره 7 شماره
صفحات -
تاریخ انتشار 2002